منابع مشابه
Cellular Automata as a Model for Dynamic Leaf Structure
Cellular automata is a system in which continuous processes are modelled in terms of discrete components. Numerical values are used to define the possible states for each component. The change of state is governed by a set of rules incorporating the states of neighbouring components. Leaf expansion was simulated in this way by assigning numerical values to cell properties and defining a set of ...
متن کاملCellular Automata: Elementary Cellular Automata
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...
متن کاملExploring and Exploiting Quantum-Dot Cellular Automata
The Full Adders (FAs) constitute the essential elements of digital systems, in a sense that they affect the circuit parameters of such systems. With respect to the MOSFET restrictions, its replacement by new devices and technologies is inevitable. QCA is one of the accomplishments in nanotechnology nominated as the candidate for MOSFET replacement. In this article 4 new layouts are presente...
متن کاملCellular Edge Detection: Combining Cellular Automata and Cellular Learning Automata
In this paper, we propose a Cellular Edge Detection (CED) algorithm which utilizes Cellular Automata (CA) and Cellular Learning Automata (CLA). The CED algorithm is an adaptive, intelligent and learnable algorithm for edge detection of binary and grayscale images. Here, we introduce a new CA local rule with adaptive neighborhood type to produce the edge map of image as opposed to CA with fixed ...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Shokubutsu Kojo Gakkaishi
سال: 2002
ISSN: 1880-3555,0918-6638
DOI: 10.2525/jshita.14.152